Extended Sierpinski's Curve and Tiling Applications
نویسنده
چکیده
We present an extension to Sierpinski’s curve that is useful for generating a large variety of highly symmetric curves. We propose a scheme for automated construction of these curves, capable of producing millions of curves. Because of their high-degree of symmetry, these curves can be utilized in various graphics design applications. In particular, we briefly describe a web-based system for automated construction of tiling designs.
منابع مشابه
Polygonal tiling of some surfaces containing fullerene molecules
A tiling of a surface is a decomposition of the surface into pieces, i.e. tiles, which cover it without gaps or overlaps. In this paper some special polygonal tiling of sphere, ellipsoid, cylinder, and torus as the most abundant shapes of fullerenes are investigated.
متن کاملSome extended Simpson-type inequalities and applications
In this paper, we shall establish some extended Simpson-type inequalities for differentiable convex functions and differentiable concave functions which are connected with Hermite-Hadamard inequality. Some error estimates for the midpoint, trapezoidal and Simpson formula are also given.
متن کاملForcing Positive Partition Relations
We show how to force two strong positive partition relations on u, and use them in considering several well-known open problems. In [32] Sierpiñski proved that the well-known Ramsey Theorem [27] does not generalize to the first uncountable cardinal by constructing a partition [ío,]2 = KQ U Kx with no uncountable homogeneous sets. Sierpinski's partition has been analyzed in several directions. O...
متن کاملMirror-curve Codes for Knots and Links
Inspired by Lomonaco–Kauffman paper on quantum knots and knot mosaics we construct the more concise representation of knot mosaics and grid diagrams via mirror-curves. We introduce codes for mirror-curves treated as knot or link diagrams placed in rectangular square grid, suitable for software implementations and discuss possible applications of mirror-curves.
متن کاملStroke Parameterization
We present a novel algorithm for generating a planar parameterization of the region surrounding a curve embedded in a 3D surface, which we call a stroke parameterization. The technique, which extends the well-known Discrete Exponential Map [SGW06], uses the same basic geometric transformations and hence is both efficient and easy-to-implement. We also handle self-intersecting curves, for which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJWA
دوره 4 شماره
صفحات -
تاریخ انتشار 2012